package demo2;

public class MyCircularQueue {
    private int[] elem;
    private int front;
    private int rear;

    public MyCircularQueue(int k){
        this.elem = new int[k+1];
    }

    //判断队列是否为空
    public boolean isEmpty(){
        if(rear == front){
            return true;
        }
        return false;
    }


    //判断队列是否满了
    public boolean isFull(){
        if(front == (rear+1)%elem.length){
            return true;
        }
        return false;
    }


    //
    public boolean enQueue(int value){
        if(isFull()){
            return false;
        }
        elem[rear] = value;
        rear = (rear+1)%elem.length;
        return true;
    }


    //
    public boolean deQueue(){
        if(isEmpty()){
            return false;
        }
        front = (front+1)%elem.length;
        return true;
    }


    //得到队头元素
    public int Front() {
        if(isEmpty()){
            return -1;
        }
        return elem[front];
    }


    //得到队尾元素
    public int Rear() {
        if(isEmpty()){
            return -1;
        }
        int index = (rear == 0)?elem.length-1 : rear-1;
        return elem[index];
    }







}
